Octants are cover-decomposable into many coverings
نویسندگان
چکیده
We prove that octants are cover-decomposable into multiple coverings, i.e., for any k there is an m(k) such that any m(k)-fold covering of any subset of the space with a nite number of translates of a given octant can be decomposed into k coverings. As a corollary, we obtain that any m(k)-fold covering of any subset of the plane with a nite number of homothetic copies of a given triangle can be decomposed into k coverings. Previously only some weaker bounds were known for related problems [21].
منابع مشابه
Octants are Cover Decomposable
We prove that octants are cover-decomposable, i.e., any 12-fold covering of any subset of the space with a finite number of translates of a given octant can be decomposed into two coverings. As a corollary, we obtain that any 12-fold covering of any subset of the plane with a finite number of homothetic copies of a given triangle can be decomposed into two coverings. We also show that any 12-fo...
متن کاملMultiple Coverings with Closed Polygons
A planar set P is said to be cover-decomposable if there is a constant k = k(P ) such that every k-fold covering of the plane with translates of P can be decomposed into two coverings. It is known that open convex polygons are cover-decomposable. Here we show that closed, centrally symmetric convex polygons are also cover-decomposable. We also show that an infinite-fold covering of the plane wi...
متن کاملMore on Decomposing Coverings by Octants
In this note we improve our upper bound given in [7] by showing that every 9-fold covering of a point set in R by finitely many translates of an octant decomposes into two coverings, and our lower bound by a construction for a 4-fold covering that does not decompose into two coverings. We also prove that certain dynamic interval coloring problems are equivalent to the above question. The same b...
متن کاملIndecomposable coverings with unit discs
We disprove the 1980 conjecture of János Pach about the cover-decomposability of open convex sets by showing that the unit disc is not cover-decomposable. In fact, our proof easily generalizes to any set with a smooth boundary. We also show that (the suitable variant of) the conjecture holds for unbounded sets. Let C be a collection of sets in R2. We say that C is an m-fold covering if every po...
متن کاملDecomposition of Geometric Set Systems and Graphs
We study two decomposition problems in combinatorial geometry. The first part of the thesis deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold covering of the plane with its translates is decomposable into two disjoint coverings of the whole plane. Pach conjectured that every convex set is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 47 شماره
صفحات -
تاریخ انتشار 2014